Designing an Eecient Solution to the Unbounded Knapsack Problem (icfp'97 Submission 6352.202)
نویسندگان
چکیده
منابع مشابه
An employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملOn dominated terms in the general knapsack problem
A necessary and sufficient condition for the identification of dominated terms in a general knapsack problem is derived. By general we mean a knapsack problem which is unbounded, equality constrained and which has a parametric right hand side. The given condition yields published results in the literature. A report on computational experiments for large scale knapsack problems, demonstrating th...
متن کاملEecient Dynamic Programming for the Unbounded Knapsack Problem
We present an eecient implementation of the dynamic programming algorithm for the unbounded knapsack problem, a classic NP-hard combinatorial optimization problem. We use four important techniques to obtain the improvements: (i) the notion of maximal dominance between the object types; the ideas of (ii) periodicity; and (iii) sparsity; and (iv) the design of a new hybrid recurrence equation tha...
متن کاملSolving Unbounded Knapsack Problem Using an Adaptive Genetic Algorithm with Elitism Strategy
With the popularity of sensor networks, solving the knapsack problem has become important in selecting the best combination of sensor nodes. Many methods have been proposed to solve the Knapsack problem, but few of them have used the genetic algorithm, especially in unbounded Knapsack problems. In this paper, we use the genetic algorithm to solve the unbounded Knapsack problem. We combine an el...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997